Automatic Grid Finding in Calibration Patterns Using Delaunay Triangulation
نویسندگان
چکیده
This paper describes a technique for finding regular grids in the images of calibration patterns, a crucial step in calibrating cameras. Corner features located by a corner detector are connected using Delaunay triangulation. Pairs of neighboring triangles are combined into quadrilaterals, which are then topologically filtered and ordered. We introduce a unique data structure for representing both triangular and quadrilateral meshes. This mesh structure allows us to exploit the strong topological constraints in a regular grid. Experiments show that the method is able to handle images with severe radial distortions. Implemented on a conventional desktop, grid matching can be done in real time. The method is also applicable to marker detections for augmented reality and robot navigation.
منابع مشابه
Adaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملAutomatic Parallel Generation of Three-dimensional Unstructured Grids for Computational Mechanics
Unstructured mesh techniques take an important place in grid generation. The main feature of unstructured grids consists, in contrast to structured grids, in a nearly absolute absence of any restrictions on grid cells, grid organization, or grid structure. It allows placing the grid nodes locally irrespective of any coordinate direction, so that complex geometries with curved boundaries can be ...
متن کاملOne-dimensional dense disparity estimation for three-dimensional reconstruction
We present a method for fully automatic three-dimensional (3D) reconstruction from a pair of weakly calibrated images in order to deal with the modeling of complex rigid scenes. A two-dimensional (2D) triangular mesh model of the scene is calculated using a two-step algorithm mixing sparse matching and dense motion estimation approaches. The 2D mesh is iteratively refined to fit any arbitrary 3...
متن کاملAutomatic construction of quality nonobtuse boundary Delaunay triangulations
In this paper we discuss the automatic construction of quality nonobtuse boundary Delaunay triangulations of polygons such as needed for control volume or nite element method applications. These are Delaunay triangulations whose smallest angles are bounded and, in addition, whose boundary triangles do not have obtuse angles opposite to any boundary or interface edge. The method we propose in th...
متن کامل3-D Automatic Mesh Generation for FEA Using Dynamic Bubble System
|In this paper, an extension of the previously developed 2-D dynamic bubble system for 3-D automatic mesh generation using tetrahedral nite elements is presented. Initially, set of vertices inside the entire analysis region is generated using 3-D dynamic bubble system, followed by automatic mesh generation according to the Delaunay tessellation algorithm and the generated set of vertices. The p...
متن کامل